Semi-automatic index term augmentation in document retrieval

ABSTRACT

Disclosed are methods and systems for indexing or retrieving materials accessible through computer networks.

CROSS-REFERENCE TO RELATED APPLICATIONS

This patent application is a continuation of application Ser. No.10/265,466, filed on Oct. 4, 2002, now U.S. Pat. No. 7,024,416, which isa divisional of application Ser. No. 09/596,644, filed on Jun. 19, 2000,now U.S. Pat. No. 6,496,818, which is a continuation-in-part ofapplication Ser. No. 09/282,730, filed on Mar. 31, 1999, now U.S. Pat.No. 7,047,242, and application Ser. No. 09/283,268, filed on Mar. 31,1999, now U.S. Pat. No. 6,826,559.

TECHNICAL FIELD

This invention relates to techniques for organizing material on computernetworks for retrieval, and more particularly to methods of indexingmaterial of interest to a user.

BACKGROUND OF THE INVENTION

Computer networks have become increasingly important for the storage andretrieval of documents and other material.

The Internet, of which the World Wide Web is a part, includes a seriesof interlinked computer networks and servers around the world. Users ofone server or network connected to the Internet may send information to,or access information on, other networks or servers connected to theInternet by the use of various computer programs which allow suchaccess, such as Web browsers. The information is sent to, or receivedfrom, a network or server in the form of packets of data.

The World Wide Web portion of the Internet comprises a subset ofinterconnected Internet sites which may be characterized as includinginformation in a format suitable for graphical display on a computerscreen. Each site may include one or more separate pages. Pages, inturn, may include links to other pages within the site, or to pages inother Web sites, facilitating the user's rapid movement from one page orsite to another.

In view of the quantity of information and material available oncomputer networks such as the Web, and for other reasons as well,automated or semi-automated techniques for retrieving information thatis thought to be relevant to a user at a given time may be employed.These techniques may be utilized in response to a specific user request,as when a search query by a user seeks information These techniques alsomay be utilized when a user is accessing certain material, in order tomake available material that it is thought may be of interest to a userwho has accessed the original material. These techniques may also beutilized when a user, given access to particular material, requestsother similar material. Other situations when these informationretrieval techniques may be employed will also be apparent to one ofordinary skill in the art.

Some information retrieval techniques such as those that are employed inthese circumstances choose documents for retrieval from among documentsin a collection based upon the occurrence of specified terms in thedocuments in the collection. (Hereinafter, for simplicity, “document”shall be used to refer to the items, such as Web pages or Web sites, inthe collection being analyzed.) There are a variety of differenttechniques for specifying the terms to be used. (A “term” maybe anyword, number, acronym, abbreviation or other collection of letters,numbers and symbols which may be found in a fixed order in a document.)In some methods, a search may be made among the documents in thecollection for some or all of the terms in a search query generated bythe user. In other methods, a search may be made for some or all of thetext of a given document. (In some methods, all terms except certaincommon words, referred to as stop words, such as “the” or “and”, may beincluded in the search.) In other methods, a search may be made forindex terms which have been associated with that document by variousmeans. Still other methods will use a combination of the abovetechniques, and further approaches to selecting terms for which a searchis to be made will be familiar to one of ordinary skill in the art.

After a list of terms for which a search is to be made has beencompiled, many information retrieval techniques then proceed bycalculating scores for each document in the collection over which thesearch is being made, based upon the occurrence of the terms on the listin the documents. These scores which are calculated may be referred toas term frequency scores, insofar as the score assigned to a documentdepends on the frequency of occurrence of terms in the document.

There are a variety of different formulae which may be used to calculatethese term frequency scores, including for example the Robertson's termfrequency score (RTF). Term frequency score formulae may assign varyingweights to terms found in a document, depending upon such factors as therelative rareness or commonness of the term. Other factors which may beused to vary the weight assigned to a term in calculating a termfrequency score will also be apparent to one of ordinary skill in theart.

Documents in a collection which is being searched may be divided intodifferent sections or segments, such as an introduction or summary, amain body, footnotes, captions, and the like. Other divisions ofdocuments will be apparent to one of ordinary skill in the art.

A Web site may permit a user to obtain lists of relevant items ofinterest, such as Web sites, other documents or names of merchantscarrying merchandise in particular categories. The site may be organizedso that an item of interest may be considered to be in more than onecategory. The site may be organized so that the categories presented tothe user may vary, depending on a term or terms specified by the user.If this approach is utilized, the user may input terms that relate tothe merchandise in which he is interested, such as “automobiles”, and inreturn he may be presented with several categories, such as“automobiles, manufacturers” or “automobiles, sales” or “automobiles,service.” The categories presented may be chosen by any one of a numberof techniques that will be familiar to one of ordinary skill in the art.

It may be desirable to present additional material to a user who issearching for items of interest. For example, it may be desirable topresent the user with banner advertisements which relate to the item ofinterest for which he is searching.

BRIEF DESCRIPTION OF DRAWINGS

The above-mentioned and other features of the invention will now becomeapparent by reference to the following description taken in connectionwith the accompanying drawings in which.

FIG. 1 is a schematic diagram of a computer system that may be operatedaccording to the present invention.

FIG. 2 illustrates a relationship between terms and documents.

FIG. 3 is a flow chart which illustrates a process, according to thepresent invention, of automatically assigning index terms to documents.

FIG. 4 illustrates a relationship between terms; documents and indexterms when some but not all documents in a collection have had indexterms manually assigned to them.

FIG. 5 is a flow chart which illustrates an overall process, accordingto the present invention, of automatically assigning index terms todocuments, where some documents have previously had index terms assignedto them.

FIG. 6 illustrates a relationship between terms, documents and indexterms after documents in a collection have had index terms assigned tothem automatically

FIG. 7 illustrates a relationship between items of interest, categoriesand supercategories when some but not all categories in a collectionhave been manually assigned to supercategories.

FIG. 8 is a flow chart which illustrates an overall process, accordingto the present invention, of automatically assigning categories tosupercategories, where some categories have previously been assigned tosupercategories.

FIG. 9 illustrates a relationship between items of interest, categoriesand supercategories when categories in a collection have been assignedto supercategories.

FIG. 10 illustrates a relationship between categories andsupercategories.

FIG. 11 is a flow chart which illustrates a process, according to thepresent invention, of assigning a supercategory to a query.

SUMMARY OF THE INVENTION

According to the present invention, a method and device for assigningindex terms to a document D_(i) in a collection of documents, whereother documents in the collection have previously had index termsassigned, comprises selecting a term I_(j) from among a set of termsfrom which the index terms are being assigned, calculating a loglikelihood ratio for the document D_(i) and a document D_(k) in thecollection to which the term I_(j) has previously been assigned as anindex term, repeating the process for a plurality of other documentsD_(k) in the collection to which the term I_(j) has previously beenassigned as an index term, calculating a total score for the DocumentD_(i) for the Index Term I_(j), repeating these steps for a plurality ofother terms I_(j) from among the set of terms from which index terms arebeing assigned, and choosing index terms to be assigned to DocumentD_(i), from among the set of terms from which index terms are beingassigned, based upon the total scores T calculated for the DocumentD_(i). The documents may be Web pages, Web sites or other collections ofmaterial. The documents in the collection which have previously hadindex terms assigned to them may have had one and only one index termassigned. The weight assigned to the index term I_(j) previouslyassigned to a document D_(n) may equal 1.0. A fixed number N of termsI_(j) whose total scores calculated for the Document D_(i) are thehighest may be assigned as index terms for the Document D_(i). The fixednumber N may be equal to 1. All terms I_(j) whose total scorescalculated for the Document D_(i) exceed a fixed cutoff score may beassigned as index terms for the Document D_(i).

Further according to the present invention, a method and device forassigning index terms to documents in a collection of documentscomprises assigning index terms to a subset of the documents in thecollection manually, selecting a document D_(i) from among the documentsin the collection to which index terms have not yet been assigned,selecting a term I_(j) from among a set of terms from which index termsare being assigned, calculating a log likelihood ratio for the documentD_(i) and a document D_(k) in the collection to which the term I_(j) haspreviously been assigned as an index term, repeating the above step fora plurality of other documents D_(k) in the collection to which the termI_(j) has previously been assigned as an index term, calculating a totalscore for the Document D_(i) for the Index Term I_(j), repeating theabove steps for a plurality of other terms I_(j) from among the set ofterms from which index terms are being assigned, choosing index terms tobe assigned to Document D_(i), from among the set of terms from whichindex terms are to be assigned, based upon the total scores calculatedfor the Document D_(i), and repeating the above steps for a plurality ofother documents in the collection to which index terms have not yet beenassigned. The documents may be Web pages, Web sites or other collectionsof material. Optionally, one and only one index term may be assigned tothe documents in the collection to which index terms are assignedmanually. The weight assigned to the index term I_(j) previouslyassigned to a document D_(n) may equal 1.0. A fixed number N of termsI_(j) whose total scores calculated for the Document D_(i) are thehighest may be assigned as index terms for the Document D_(i). The fixednumber N may equal 1. All terms I_(j) whose total scores calculated forthe Document D_(i) exceed a fixed cutoff score may be assigned as indexterms for the Document D_(i).

Further according to the present invention, a method and device forassigning categories of items to supercategories, or categories ofcategories, comprises: assigning a subset of the categories in thecollection to supercategories manually, selecting a category C_(i) fromamong the categories in the collection not yet assigned tosupercategories, calculating a likelihood function L_(ik) for thecategory C_(i) and a category C_(k) in the collection which haspreviously been assigned to a supercategory S_(j) manually, whichlikelihood function is based upon the likelihood that a term occurringin the category C_(i) also occurs in the category C_(k) repeating theabove step for a plurality of other categories C_(k) in the collectionwhich have previously been assigned to a supercategory S_(j) manually,assigning the category C_(i) to a supercategory S_(j) based on thelikelihood functions L_(ik) that a term occurring in the category C_(i)also occurs in the category C_(k) which is assigned to supercategoryS_(j), and repeating the above steps for a plurality of other categoriesin the collection which have not yet been assigned to supercategoriesand which have not yet been processed. The categories may correspond tovarieties of products or services. The items in the categories maycorrespond to merchants, stores or other sources of the category'sproduct or service, and the merchants, stores or other sources may beassociated with more than one category of products or services. Thesupercategories may correspond to groups of categories as to which it isdesired to present the same banner advertisement to a user accessing thecategories.

Further according to the present invention, a method and device forassigning categories of items to supercategories, or categories ofcategories, comprises: assigning a subset of the categories in thecollection to supercategories manually, selecting a category C_(i) fromamong the categories in the collection not yet assigned tosupercategories, selecting a supercategory S_(j) from among the set ofsupercategories, calculating a log likelihood ratio for the categoryC_(i) and a category C_(k) in the collection which has previously beenassigned to the supercategory S_(j), repeating the above step for aplurality of other categories C_(k) in the collection which havepreviously been assigned to the supercategory S_(j), calculating a totalscore for the category C_(i) for the supercategory S_(j), repeating theabove steps for a plurality of other supercategories S_(j), assigningcategory C_(i) to the supercategory for which the total score calculatedfor the category C_(i) is the highest, and repeating the above steps fora plurality of other categories in the collection which have not yetbeen assigned to supercategories. The categories may correspond tovarieties of products or services. The items in the categories maycorrespond to merchants, stores or other sources of the category'sproduct or service, and the merchants, stores or other sources may beassociated with more than one category of products or services Thesupercategories may correspond to groups of categories as to which it isdesired to present the same banner advertisement to a user accessing thecategories. For example, in one embodiment there may be about 20,000categories of products or services, and there may be about 50supercategories.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT(S)

Referring to FIG. 1, a computer system 2001 includes a workstation 2002having local storage 2003. The workstation may also be connected to alocal area network 2004 and may access to the Internet 2005. TheInternet 2005 may include or be coupled to remote storage 2006. Theworkstation 2002 may be any one of a variety of commercially availablecomputers capable of providing the functionality described in moredetail below. The local storage 2003 may include ROM, RAM, a hard disk,a CD, and/or any other media capable of containing data and/or programsfor the workstation 2002 or other data. The local area network 2004,which is coupled to and exchanges data with the workstation, may alsocontain data and/or program information for use by the workstation 2002.The Internet 2005 may be accessed in a conventional manner by theworkstation 2002. Alternatively, the workstation 2002 may access theInternet 2005 through the local area network 2004, as shown by thedotted line of FIG. 1. The remote storage 2006 may also contain dataand/or program information for the workstation 2002 or may contain otherinformation, as will become apparent from the description below.

The system described herein permits a user (utilizing the computersystem 2001 which includes the workstation 2002) who has accessed theInternet 2005, either directly or through the local area network 2004,to be given access to material that may be of interest to him. It willbe appreciated by one of ordinary skill in the art that the system maybe implemented using a variety of computers and programming languages.The system may be accessed by the user through the Internet 2005 fromhis workstation 2002 using a Web browser of conventional design, aswould be familiar to one of ordinary skill in the art

In the prior art, it is well known that information retrieval techniquesmay be utilized to identify documents, such as Web pages or sites, orportions of documents which may be of interest to a user. (Hereinafter,for simplicity, “document” shall be used to refer to the items, such as[but not limited to] pages or sites, in the collection being analyzed.)These techniques may be called into play in response to a search queryinitiated by the user. Alternatively, they may be called into play whena user requests additional documents that are similar to a document towhich he has been given access. Alternatively; they may be called intoplay when a user is accessing a particular document, and it is desiredto make available to him other documents that are related to thedocument being accessed. Other circumstances where it may be desirableto utilize information retrieval techniques to identify documents thatmay be of interest to a user will be apparent to one of ordinary skillin the art.

Information retrieval techniques may choose documents from among thedocuments in a collection based upon the occurrence in the documents ofspecified terms. The terms to be utilized in this process may beselected by a number of methods that will be apparent to one of ordinaryskill in the art.

One technique that may be employed to select terms to be utilized in theprocess is to permit the user to specify terms by defining a searchquery. Another technique that may be employed is to select some or allof the terms in a document being accessed by the user. Another techniquethat may be employed is to select some or all of the terms in a documentidentified by the user as being of interest to him, or as havingcharacteristics he wishes to have found in documents made available tohim. (In these techniques, all of the terms may be used, or certaincommon words, referred to as stop words, such as “the” or “and”, may beomitted.) Another technique that may be employed is to select indexterms which have previously been associated with the document beingaccessed or selected by the user. Still other techniques may use acombination of the above approaches. Other techniques for selectingterms to be utilized will be apparent to one of ordinary skill in theart.

Once a list of terms has been generated, by the above methods or anyother, information retrieval techniques may proceed by calculating, foreach document in the collection from which documents of potentialinterest are to be chosen, a score which reflects the occurrence in thedocument of the terms on the list. Based upon the scores achieved by thedocuments in the collection, the documents may be ranked, and apredetermined number of documents may be presented to the user, or alldocuments which achieve scores above a predetermined cutoff may bepresented.

These scores which are calculated for documents are sometimes referredto as term frequency scores, in that the scores depend in part upon thefrequency of occurrence of terms in the document.

The formula for calculating a total score S_(D) for a document D may bewritten generally as:

$S_{D} = {\sum\limits_{T = 1}^{T_{0}}{TF}_{TD}}$

where: T₀ is the number of terms T which occur in the collection ofterms included in the search, and

TF_(TD) is the term frequency score for document D based on thefrequency of occurrence in document D of term T.

One particular formula in the prior art which may be used to assign atotal score S_(D) to a document D utilizes Robertson's term frequencyscore:

${S_{D} = {\sum\limits_{T = 1}^{T_{0}}{{TF}_{TD}*{IDF}_{T}}}},$

where: T₀ is the number of terms which occur in the collection of termsincluded in the search,

TF_(TD) is Robertson's term frequency for term T in document D,=N _(TD)/(N _(TD) +K ₁ +K ₂*(L _(D) /L ₀)),

where: N_(TD) is the number of times the term T occurs in document D,

L_(D) is the length of document D,

L₀ is the average length of a document in the collection being searched,and

K₁ and K₂ are constantsand IDF _(T)=log((N+K ₃)/N _(T))/log(N+K ₄)

where:

N is the number of documents in the collection

N_(T) is the number of documents containing the term T in thecollection, and

K₃ and K₄ are constants.

Whatever particular formula is used, documents are ranked in order oftheir total scores S_(D), and those which achieve the highest score arepresented, typically in order of their scores, to the user

In order to improve the effectiveness of information retrieval methods,additional terms may be associated with documents before term frequencyscores are calculated. For example, index terms or key words may beassociated with each document in a collection, and the calculation ofterm frequency scores may take into account the index terms or key wordsas well as terms that occur in the documents themselves, or may be basedsolely on the index terms or key words.

These additional terms may be assigned to a document by means of manualreview of the document or by automatic means, or by a combination ofmanual review and automatic means. Methods for doing so by manual meanswill be apparent to one of ordinary skill in the art.

The manual assignment of index terms to a document may be timeconsuming, and this may make it impractical to assign index terms tolarge collections of documents by this method. In addition, manualassignment of index terms may fail to reveal underlying relationshipsbetween documents. It may therefore be useful to utilize automatictechniques to generate appropriate index terms for documents, based uponanalysis of the characteristics of the terms which occur in thedocuments.

In one embodiment of the system described herein, additional index termsare added to a set of documents D in a document collectionautomatically. In this embodiment, terms are chosen to be added as indexterms to a given document D_(i) automatically according to theirco-occurrence to a high degree with terms already found in the documentD_(i), according to the method of local context analysis. This methodhas been described by Xu and Croft, in Improving the Effectiveness ofInformational Retrieval with Local Context Analysis, which isincorporated herein by reference.

FIG. 2 illustrates a collection of Documents D 2020 which contain TermsT 2010. As illustrated in FIG. 2, each Term T 2010 may occur in one ormore Documents D 2020, and each Document D 2020 contains one or moreTerms T 2010.

According to FIG. 3, this method 2050 proceeds first at a step 2060 toselect a Document D which has not yet had index terms assigned to it. Atstep 2070, a search Query Q_(i) is created, consisting of Terms T_(j)found in Document D_(i). In one embodiment of the system, the set ofTerms T_(j) in the Document D_(i) used to create the Query Q_(i)comprises all of the Terms in the Document D_(i). In another embodiment,the set of Terms T_(j) comprises all of the Terms in the Document D_(i)except certain common words, referred to as stop words, such as “the” or“and.”

In this embodiment, after the query Q_(i) is prepared at step 2070 it isapplied at step 2080 to a chosen collection C₀ consisting of Hdocuments. This collection of documents C₀ may be the set of documentsfor which index terms are being generated by automatic means, it may bea larger set of documents including those documents for which indexterms are being generated by automatic means as a subset, or it may beanother set of documents, such as the set of documents over whichsearches will be done utilizing the index terms. It is helpful if thecollection C₀ has the property that the usage of terms in documents init is characteristic of the usage of terms that will be found indocuments over which searches will be carried out using the additionalindex terms added to the documents.

In applying the query at the step 2080, a total score S_(D) for adocument D in the collection of documents C₀ searched may be writtengenerally as:

$S_{D} = {\sum\limits_{T = 1}^{T_{0}}{TF}_{TD}}$

where: T₀ is the number of terms T which occur in the query Q_(i), and

TF_(TD) is the term frequency score for document D based on thefrequency of occurrence in document D of term T,

While any one of a number of formulas for term frequency and inverteddocument frequency which will be known to one of ordinary skill in theart may be used without departing from the spirit and scope of theinvention, in one embodiment of the system, Robertson's term frequencyscore is used to assign a total score S_(D) to a document D:

${S_{D} = {\sum\limits_{T = 1}^{T_{0}}{{TF}_{TD}*{IDF}_{T}}}},$

where: T₀ is the number of terms which occur in the query Q_(i),

TF_(TD) is Robertson's term frequency for term T in document D,=N _(TD)/(N _(TD) +K ₁ +K ₂*(L _(D) /L ₀)),

where: N_(TD) is the number of times the term T occurs in document D,

L_(D) is the length of document D,

L₀ is the average length of a document in the collection C₀ beingsearched, and

K₁ and K₂ are constantsand IDF _(T)=log((N+K ₃)/N _(T))/log(N+K ₄)

where:

N is the number of documents in the collection C₀

N_(T) is the number of documents containing the term T in the collectionC₀, and

K₃ and K₄ are constants.

After the query is run at step 2080, at a step 2090 a number ofdocuments N₀ in C₀ which achieve the highest scores under the searchquery Q_(i) are selected. For example, in various embodiments the numberN₀ may be between 10 and 300, but it may vary depending on operationalconsiderations which will be apparent to one of ordinary skill in theart. In one embodiment, the number of documents N₀ selected is 50. Thisset of N₀ documents has the property that Documents in it contain Termsalso found in Document D_(i), the document which is having index termsassigned to it. The next steps 2100 to 2150 in the process 2050 thenattempt to determine which other terms in the N₀ documents occur mostfrequently with the Terms T_(j) in the Document D_(i).

After the N₀ documents are selected in the step 2090, the systemcontinues at step 2100 by choosing a Term T_(k) from among the Termsfound in the N₀ documents. In one embodiment, all terms in the N₀documents are used. In another embodiment, all terms in the N₀ documentsexcept certain common words, referred to as stop words, such as “the” or“and,” are used,

At a step 2110, the system then chooses a Term T_(j) from among theTerms in the Document D_(i) which is having index terms assigned to it.

At a step 2120, the system then proceeds by calculating theco-occurrence C_(n) (T_(j), T_(k)) of the Term T_(k) from the N₀documents with the Term T_(j) from the Document D_(i). The co-occurrenceC_(n) (T_(j), T_(k)) of a given Term T_(k) which occurs in the N₀documents, with a Term T_(j) in Document D_(i), is determined asfollows:C _(n)(T _(j) , T _(k))=log₁₀(co_(ki)(T _(j) , T _(k))+1)*idf(T_(k))/log₁₀(N ₀),

${{{where}\text{:}\mspace{14mu}{{co}_{ki}\left( {T_{j},T_{k}} \right)}} = {\sum\limits_{n = 1}^{N_{0}}{{{tf}\left( {T_{k},n} \right)}*{{tf}\left( {T_{j},n} \right)}}}},$

tf (T_(k), n)=number of occurrences of term T_(k) in Document n in theN₀ documents,

tf (T_(j), n)=number of occurrences of term T_(j) in Document n in theN₀ documents,

idf (T_(k))=the inverted document frequency for the term T_(k),=min(1.0, log₁₀(N/N _(T))/5.0)

N=the number of documents in the collection C₀ over which the queryQ_(i) was run, and

N_(T)=the number of documents in the collection C₀ over which the queryQ_(i) was run, which contain the term T_(k),

The system then proceeds to a step 2130 If it is determined at the step2130 that not all Terms T_(j) from among the Terms in the DocumentD_(i), have had their co-occurrences calculated with the Term T_(k) fromthe N₀ documents, control returns to step 2110, and the co-occurrence ofanother Term T_(j) from among the Terms in the Document D_(i), iscalculated with the Term T_(k) from the N₀ documents.

If it is determined at the step 2130 that all Terms T_(j) from theDocument D_(i), have had their co-occurrences calculated with the TermT_(k) from the N₀ documents, control passes to a step 2140, at which ascore f_(D) (T_(k)) is calculated for the term T_(k) with respect to thedocument D_(i):T ₀ idf(T _(j)) f _(D)(T _(k))=Π(δ+C _(ni)(T _(k) , T _(j))) j=1

where T_(j)=a term in document D_(i),

-   -   T₀=the number of terms in document D_(i),    -   idf (T_(j)) =the inverted document frequency for the term T_(j),        =min (1.0, log₁₀(N/N _(J))/5.0),    -   N=the number of documents in the collection C₀ over which the        query Q_(i) was run,    -   N_(J)=the number of documents in the collection C₀ over which        the query Q_(i) was run,        -   which contain the term T_(j) and    -   δ=a constant. (In one embodiment, δ may be assigned a value of        0.01, but this value may be varied without departing from the        spirit and scope of the invention.)

After f_(D) (T_(k)) is calculated at the step 2140, control passes to astep 2150. If it is determined at the step 2150 that not all Terms T_(k)from among the Terms in the N₀ documents have had their Scores f_(D)(T_(k)) calculated for the Document D_(i), control returns to step 2100,and the process of steps 2100-2140 is carried out for another Term T_(k)from among the Terms in the N₀ documents.

If it is determined at the step 2150 that all Terms T_(k) from among theTerms in the N₀ documents have had their Scores f_(D) (T_(k)) calculatedfor the Document D_(i), control passes to a step 2160, at which indexterms are chosen for the Document D_(i). To do so, in this embodimentthe values of f_(D) (T_(k)) for the Document D_(i) are compared for theterms T_(k) in the N₀ documents, and the terms T_(k) with the highestvalues of f_(D) (T_(k)) for the Document D_(i) are chosen as additionalterms to be added as index terms to the Document D_(i). While the numberof terms added may vary without departing from the spirit and scope ofthe invention, in one embodiment 30 terms are chosen to be added asindex terms.

After index terms are assigned to Document D_(i) at the step 2160,control passes to a step 2170. If it is determined at the step 2170 thatnot all Documents D_(i) have had index terms assigned, control returnsto step 2060, and the process of steps 2060-2160 is carried out foranother Document D_(i).

If it is determined at the step 2170 that all Documents D_(i), have hadindex terms assigned, this portion of the system is completed.

The system described herein may be employed via a Web site whichpresents a user with, or permits a user to obtain, specific documents orlists of documents, such as Web sites, names of merchants or storescarrying merchandise in particular categories, or other documents, andwhich uses index terms assigned to documents to assist in the process ofidentifying documents for presentation to the user, or for inclusion ina list to be presented to the user.

A further aspect of the system described herein may be employed whensome of the documents in the collection from which the selections) areto be made have had index terms assigned to them manually (or by otherautomatic methods), but index terms have not been assigned to alldocuments, and it is desired to assign index terms to the remainingdocuments automatically.

According to FIG. 4, in one embodiment of the system described herein,there may be a very large number of Documents D 2420 which contain TermsT 2410.

In this embodiment of the system, it is desired to assign an Index TermI 2440 or Index Terms to each Document D.

It may desirable in this embodiment of the system to associate eachDocument D 2420 with one and only one Index Term I 2440, or it may bedesired to associate a plurality of Index Terms with a Document D.

Index Terms may be associated with Documents manually. However, manualassociation is time consuming and therefore costly, and this isparticularly the case if the Documents and/or Index Terms may changefrequently. The system described herein therefore permits Documents tobe assigned Index Terms automatically, after an initial group ofDocuments have been assigned manually. FIG. 4 illustrates therelationship of Terms, Documents and Index Terms, when some Documentshave been assigned Index Terms manually, and others have not had IndexTerms assigned. (It will be understood by one of ordinary skill in theart that the system here described may also be applied where an initialgroup of documents have had Index Terms assigned by another automaticmethod, rather than manually.)

According to FIG. 5, the process 2450 of assigning Index Terms 2440 toDocuments 2420 begins at a step 2460 in which an (as-yet-unprocessed)Document D_(i) to which no Index Terms have been assigned manually isselected. Control then passes to a step 2470 at which an(as-yet-unanalyzed for the selected unprocessed Document D_(i)) IndexTerm I_(j) is selected. (The Index Terms may consist of a set of termschosen from among the Terms T which occur in the collection ofdocuments, or they may be chosen independently of whether they occuramong the Terms in the document collection.) Control then passes to astep 2480 at which a Document D_(k), which has been manually assignedIndex Term I_(j) is selected.

At a step 2490, the process 2450 then calculates the log likelihoodratio L (D_(i), D_(k)):

${{L\left( {D_{i},D_{k}} \right)} = {\log\left( {\sum\limits_{m = 1}^{M_{0}}{{\underset{m}{\Pi}\left( {D_{i},D_{k}} \right)}/{\sum\limits_{m = 1}^{M_{0}}{\underset{m}{\Pi}\left( D_{i} \right)}}}} \right)}},{{where}\text{:}}$$\begin{matrix}{{{\underset{m}{\Pi}\left( {D_{i},D_{k}} \right)} = 1},{{if}\mspace{14mu}{Term}\mspace{14mu} m\mspace{14mu}{is}{\;\;}{in}\mspace{11mu}{Document}\mspace{14mu} D_{i}\mspace{11mu}{and}{\;\mspace{11mu}}{to}{\;\;}{Document}\mspace{11mu} D_{k}}} \\{= {0\mspace{14mu}{otherwise}}}\end{matrix}$ $\begin{matrix}{{{\underset{m}{\Pi}\left( D_{i} \right)} = 1},{{if}\mspace{14mu}{Term}\mspace{14mu} m\mspace{14mu}{is}\mspace{14mu}{in}\mspace{14mu}{Document}\mspace{14mu} D_{i}}} \\{= {0\mspace{14mu}{otherwise}}} \\{M_{0} = {{the}\mspace{14mu}{number}{\mspace{11mu}\;}{of}{\mspace{11mu}\;}{Terms}{\mspace{11mu}\;}{which}{\;\mspace{11mu}}{are}\mspace{14mu}{in}\mspace{14mu}{Document}\mspace{14mu}{D_{i}.}}}\end{matrix}$

Control then passes to a step 2500, at which it is determined if thereremain any further Documents D_(k), manually assigned the Index TermI_(j) being analyzed, for which the log likelihood ratio of thatDocument D_(k) to the Document D_(i) being processed has not yet beencalculated. If any such Documents D_(k) remain at the step 2500, controlreturns to the step 2480 at which a further Document D_(k), which hashad Index Term I_(j) manually assigned to it, is chosen for calculation.If no such Documents D_(k) remain at the step 2500, control insteadpasses to a step 2510 at which is calculated the total score T (D_(i),I_(j)) for the unprocessed Document D_(i) for the Index Term I_(j)

${{T\left( {D_{i},I_{j}} \right)} = {\sum\limits_{k = 1}^{K_{0}}{{W\left( {D_{k},I_{j}} \right)}*{{L\left( {D_{i},D_{k}} \right)}/{\sum\limits_{k = 1}^{K_{0}}{W\left( {D_{k},I_{j}} \right)}}}}}},$where

K₀=the number of Documents manually assigned Index Term I_(j),

W(D_(k), I_(j))=the weight assigned to Index Term I_(j) for DocumentD_(k)

This system permits varying weights to be assigned to different IndexTerms I_(j) associated with a given Document D. The weights assigned tothe index terms associated with a given Document D may be equal, or theymay be varied to reflect the degree of importance associated with theIndex Term, or they may be varied to reflect the degree of confidencewith which the Index Term is believed to represent the characteristicsof the document. Other reasons and methods of varying the weightassigned to an Index Term associated with a Document will be apparent toone of ordinary skill in the art.

In the case where each Document D has assigned to it only a single IndexTerm In, then W(D_(k), I_(j))=1 for the one and only one Index TermI_(j) assigned to Document D_(k), and the formula for the total score T(D_(i), I_(j)) is simplified:

${{T\left( {D_{i},I_{j}} \right)} = {\sum\limits_{k = 1}^{K_{0}}{{L\left( {D_{i},D_{k}} \right)}/K_{0}}}},$where

K₀=the number of Documents manually assigned Index Term I_(j).

Control then passes to a step 2520, at which it is determined if thereremain any further Index Terms I_(j) for which total scores T (D_(i),I_(j)) have not yet been calculated for the Document D_(i) beingprocessed. If any such Index Terms I_(j) remain at the step 2520,control returns to the step 2470 at which a further Index Term I_(j) ischosen for analysis with the Document D_(i). If no such Index TermsI_(j) remain at the step 2520, control instead passes to a step 2530 atwhich an Index Term or Index Terms are selected to be associated withthe Document D_(i) being processed.

In one embodiment of the system, a single Index Term I_(M), whose totalscore T (D_(i), I_(j)) for the Document D_(i) being processed is thehighest, is selected as the index term for Document D_(i). In anotherembodiment of the system, a predetermined number R of Index Terms may beselected as index terms for Document D_(i). In this embodiment, the RIndex Terms with the highest total scores T (D_(i), I_(j)) are selected.In another embodiment, all Index Terms whose total scores T (D_(i),I_(j)) exceed a predetermined cutoff score T₀ are selected as indexterms for Document D_(i). (In any of these embodiments, if noco-occurrences were found between the Document D_(i) being processed andany document which has been manually assigned index terms, then no indexterms are assigned to the Document D_(i).)

Control then passes to a step 2540 at which it is determined if thereremain any further Documents D_(i), which were not assigned index termsmanually, which have not yet been processed. If any such unprocessedDocuments D_(i) remain at the step 2540, control returns to the step2460 at which a further as-yet-unprocessed Document D_(i) is chosen forprocessing. If no such unprocessed Documents D_(i) remain at the step2540, the process 2450 is concluded, and each Document D_(i), to whichno Index Terms had been assigned manually, either has been assignedIndex Terms or has been found not to have co-occurrences with anyDocument which had index terms manually assigned to it. According toFIG. 6, when the process 2450 has been completed, Index Terms 2440 willhave been assigned to Documents 2420 containing Terms 2410, except forDocuments 2420 which could not be assigned Index Terms 2440 because theylack any co-occurrences with any Document 2420 which had Index Terms2440 manually assigned to it.

The system described herein may be utilized in one embodiment inconnection with the assignment of categories consisting of items ofinterest into categories of categories, or supercategories.

In this embodiment, an item of interest may be considered to be amerchant, store or other source for a product or service, or a number of(related or unrelated) products or services. Each variety of product orservice may be considered to be a category (such as, for example, “AutoDealers, Used Cars/”). In this embodiment, items of interest (merchantsor stores, such as, for example, “Lannan Chevrolet, Oldsmobile”) may beassigned to more than one category (variety of product or service).

In this embodiment, it is desired to present categories to a user inresponse to his request. The categories presented to the user may vary,depending on a term or terms (such as, for example, “automobiles, used”)specified by the user in the request. The categories presented may bechosen by any one of a number of techniques that will be familiar to oneof ordinary skill in the art.

In this embodiment of the system described herein, it is desired topresent additional material to a user who is searching for items ofinterest. For example, it may be desired to present the user with banneradvertisements (such as for automobile financing sources) which relateto the item of interest (such as used cars) for which he is searching.

According to FIG. 7, in one embodiment of the system described herein,there may be a very large number of individual items of interest 2810 tobe organized into categories 2820 for presentation. While the number mayvary without departing from the spirit and scope of the invention, theremay be about 20,000 categories.

In this embodiment of the system, it is desired to choose a banneradvertisement to present to a user The banner advertisements in turn maybe divided into categories 2840. While the number may vary withoutdeparting from the spirit and scope of the invention, there may be about50 categories 2840 into which the banner advertisements may be divided.(To avoid confusion with the categories into which the items of interestare divided, these banner advertisement categories 2840 are referred toherein as “supercategories.” 2840)

It is desirable in this embodiment of the system to associate eachcategory 2820 of items of interest 2810 with one and only onesupercategory 2840 of banner advertisements, such that when a user isaccessing that category 2820 of item he is presented with banneradvertisements from the corresponding supercategeory 2840. (For example,in one embodiment the category “Auto Dealers, Used Cars” may be assignedto a supercategory also comprising other categories related toautomobiles, such as “Automobile Dealers” and/or “Auto Repair &Service.”)

Categories may be associated with supercategories manually. However,manual association is time consuming and therefore costly, and this isparticularly the case if the categories and supercategories may changefrequently. This embodiment of the system described herein thereforepermits categories to be assigned to supercategories automatically,after an initial group of categories have been assigned manually. FIG. 7illustrates the relationship of items of interest categories andsupercategories, when some categories have been assigned tosupercategories, and others remain unassigned. While the number may varywithout departing from the spirit and scope of the invention, in oneembodiment there may be about 2,000 categories manually assigned tosupercategories.

According to FIG. 8, the process 2850 of assigning categories 2820 tosupercategories in this embodiment of the system 2840 begins at a step2860 in which an (as-yet-unprocessed) unassigned category C_(i) isselected. Control then passes to a step 2870 at which an(as-yet-unanalyzed for the selected unassigned category) supercategoryS_(j) is selected. Control then passes to a step 2880 at which acategory C_(k), which has been manually assigned to supercategory S_(j)is selected.

At a step 2890, the process 2850 then calculates the log likelihoodratio L (C_(i), C_(k)):

${{L\left( {C_{i},C_{k}} \right)} = {\log\left( {\sum\limits_{m = 1}^{M_{0}}{{\underset{m}{\Pi}\left( {C_{i},C_{k}} \right)}/{\underset{m = 1}{\sum\limits^{M_{0}}}{\Pi_{m}\left( C_{i} \right)}}}} \right)}},$where:

Π_(m)(C_(i), C_(k))=1, if item of interest m is assigned to categoryC_(i) and to category C_(k)

$\begin{matrix}{{\underset{m}{\Pi}\left( C_{i} \right)} = {0\mspace{14mu}{otherwise}}} \\{{= 1},{{if}{\mspace{11mu}\;}{item}{\mspace{11mu}\;}{of}{\;\mspace{11mu}}{interest}\mspace{14mu} m\mspace{14mu}{is}\mspace{14mu}{assigned}{\;\mspace{11mu}}{to}{\mspace{11mu}\;}{category}\mspace{14mu} C_{i}}} \\{= {0\mspace{14mu}{otherwise}}} \\{M_{0} = {{the}{\mspace{11mu}\;}{number}{\mspace{11mu}\;}{of}{\;\mspace{11mu}}{items}\mspace{14mu}{of}{\;\mspace{11mu}}{interest}{\mspace{11mu}\;}{which}{\mspace{11mu}\;}{are}{\mspace{11mu}\;}{assigned}}} \\{{to}{\mspace{11mu}\;}{category}\mspace{14mu} C_{i}}\end{matrix}$

Control then passes to a step 2900, at which it is determined if thereremain any further categories C_(k), manually assigned to thesupercategory S_(j) being analyzed, for which the log likelihood ratioof that manually assigned category C_(k) to the category being processedC_(i), has not yet been calculated. If any such manually assignedcategories C_(k) remain at the step 2900, control returns to the step2880 at which a further manually assigned category C_(k) is chosen forcalculation. If no such manually assigned categories C_(k) remain at thestep 2900, control instead passes to a step 2910 at which is calculatedthe total score T (C_(i), S_(j)) for the unprocessed category C_(i) forthe supercategory S_(j):

${{T\left( {C_{i},S_{j}} \right)} = {\sum\limits_{k = 1}^{K_{0}}{{L\left( {C_{i},C_{k}} \right)}/K_{0}}}},$where

K₀=the number of categories manually assigned to supercategory S_(j)

Control then passes to a step 2920, at which it is determined if thereremain any further supercategories S_(j) for which total scores T(C_(i), S_(j)) have not yet been calculated for the category C_(i) beingprocessed. If any such supercategories S_(j) remain at the step 2920,control returns to the step 2870 at which a further supercategory S_(j)is chosen for analysis with the category C_(i). If no suchsupercategories S_(j) remain at the step 2920, control instead passes toa step 2930 at which is selected a supercategory S_(M) whose total scoreT (C_(i), S_(j)) for the category C_(i) being processed is the highest.The category being processed C_(i) then is assigned to the supercategoryS_(M). (If no co-occurrences have been found between the category C_(i)being processed and any category manually assigned to a supercategory,the category C_(i) being processed is not assigned to anysupercategory.)

Control then passes to a step 2940 at which it is determined if thereremain any further unassigned categories C_(i) not yet processed. If anysuch unprocessed categories C_(i) remain at the step 2940, controlreturns to the step 2860 at which a further as-yet-unprocessed categoryC_(i) is chosen for processing. If no such unprocessed categories C_(i)remain at the step 2940, the process 2850 is concluded, and eachpreviously-unassigned category C_(i) has either been assigned to asupercategory S_(j), or it has been determined that it has noco-occurrences with any manually-assigned category, and hence nosupercategory S_(j) assignment has been made for it. According to FIG.9, all categories 2820 containing items of interest 2810 will have beenassigned to supercategories 2840, except for those categories 2820 as towhich it has been determined that the category 2820 has noco-occurrences with any manually-assigned category 2820.

When additional terms such as index terms or key words are assigned to adocument, such as by the system described herein, the additional termsmay be considered as terms along with the terms that occur in thedocument itself for purposes of calculating term frequency scores. Theoriginal terms and the index terms may be used together in searches, orthe index terms alone may be used.

It may be thought that the occurrence among the additional terms of aterm for which a search is being made may be more or less important as apredictor of the utility of the document than the occurrence of a termfound in the document itself. A technique for taking into accountwhether a term occurs in a document itself or among the additional termsassociated with the document, in the calculation of a term frequencyscore for that document, therefore may be useful.

In addition, documents in a collection which is being searched mayconsist of various segments or sections. The segments or sections mayinclude a title, an abstract or introduction or summary, captions, andfootnotes. Other sections or segments into which a document may bedivided will be apparent to one of ordinary skill in the art.

In some circumstances, it may be thought that the occurrence of a termin one segment of a document may be more predictive of the utility ofthat document than its occurrence in another segment. A technique fortaking into account the segment of a document in which a given termoccurs, in the course of calculating a term frequency score for thatdocument, therefore may be useful.

According to the system being described herein, a weight W_(SD) may beassigned to each segment S_(i) of a document D containing S₀ segments.In one embodiment of the system:

${\sum\limits_{S_{1} = 1}^{S_{0}}W_{SD}} = 1.$

In one embodiment of the system, an entire document itself is considereda single segment, and the additional index terms associated with thedocument, such as by the system described herein, are considered asecond segment. In that embodiment, there are a total of two segments ina document, including the new segment containing the index terms.

In a further embodiment of the system, the index terms associated withthe document, such as by the system described herein, are considered asegment, and the text of the document itself may be divided into anumber of separate segments which may include a title, at abstract orintroduction or summary, captions, and footnotes. Other sections orsegments into which a document may be divided will be apparent to one ofordinary skill in the art.

In a further embodiment of the system, where additional terms such asindex terms have been associated with a document by more than onemethod, for each method used the additional terms associated with thedocument by that method may be considered a separate segment of thedocument.

In a further embodiment of the system, where no additional terms havebeen associated with the document, the text of the document itself maybe divided into a number of separate segments which may include a title,an abstract or introduction or summary, captions, and footnotes.

The weights W_(SD) assigned to the segments of documents may be chosenarbitrarily.

In one embodiment of the system, the weights W_(SD) assigned to thesegments S_(i) of a document D may be individually determined inadvance, based upon a decision about the relative utility of varioussegments of the document D in determining the relevance of the documentunder various criteria.

In an embodiment of the system, a given segment S_(i) may be required tohave equal weight W_(SD) in all documents.

In a further embodiment, the weight W_(SD) of a given segment S_(i) ofdifferent documents may be different, based upon the relative utility ofthat segment of each document in predicting whether that document willbe of interest to a user.

The weights assigned to the segments S_(I) of a document containing theadditional terms assigned to the document may be varied based upon themethod used to assign the additional terms, and the degree to which theadditional terms are considered to be highly related to the content ofthe documents. In an embodiment of the system, a segment S_(I) may berequired to have equal weight W_(SD) in all documents. In a furtherembodiment, the weights W_(SD) of the segments S_(I) of differentdocuments may be different, based upon the method used to assign theadditional terms, and the degree to which the additional terms areconsidered to be highly related to the content of each document.

In one embodiment of the system, the weights W_(SD) are varied dependingon the results of experiments which vary the weights for test searchesand evaluate the utility of the results returned, either in terms ofprecision (the ability of the search formula to avoid returningdocuments that are not useful), or of recall (the ability of the searchformula to avoid omitting documents that are usefull), or of acombination of the two.

When it is determined to calculate a term frequency score under a givensearch query Q for a document D with S₀ segments in the collection ofdocuments C₀ being searched under the system, a generalized termfrequency score may be calculated as follows:

$S_{D} = {\sum\limits_{T = 1}^{T_{0}}{\sum\limits_{S_{i} = 1}^{S_{0}}{TF}_{STD}}}$

where: S_(D) is the total score for the document D,

To is the number of terms which occur in the search query Q, and

TF_(STD) is the score for document D based on the occurrence of term Tin segment S_(i) of document D.

In one embodiment of the system, scores are assigned to documentsutilizing Robertson's term frequency score, and the generalized termfrequency score S_(D) for a document D may be calculated as follows:

$S_{D} = {\sum\limits_{T = 1}^{T_{0}}{\sum\limits_{S_{i} = 1}^{S_{0}}{{TF}_{STD}*{IDF}_{ST}}}}$where:${{S_{D}\mspace{14mu}{is}{\mspace{11mu}\;}{the}\mspace{14mu}{total}{\;\mspace{11mu}}{score}\mspace{14mu}{for}{\;\mspace{11mu}}{the}{\;\mspace{11mu}}{document}\mspace{14mu} D},{T_{0}{\mspace{11mu}\;}{is}{\;\mspace{11mu}}{the}\mspace{14mu}{number}{\mspace{11mu}\;}{of}{\;\mspace{11mu}}{terms}{\;\mspace{11mu}}{which}{\mspace{11mu}\;}{occur}\mspace{14mu}{in}\mspace{14mu}{the}\mspace{14mu}{search}{\mspace{11mu}\;}{query}\mspace{14mu} Q},{S_{0}\mspace{14mu}{is}\mspace{14mu}{the}{\mspace{11mu}\;}{number}{\mspace{11mu}\;}{of}{\mspace{11mu}\;}{segments}{\mspace{11mu}\;}{in}\mspace{14mu}{the}{\mspace{11mu}\;}{document}\mspace{14mu} D},\begin{matrix}{{TF}_{STD} = {{{Robertson}'}s{\mspace{11mu}\;}{generalized}\mspace{14mu}{term}{\mspace{11mu}\;}{frequency}}} \\{{score}{\;\mspace{11mu}}{for}{\mspace{11mu}\;}{Term}\mspace{14mu} T\mspace{14mu}{in}\mspace{14mu}{Segment}\mspace{14mu} S_{i}}\end{matrix}}{\mspace{11mu}\;\mspace{11mu}\;}$of   Document  D = G_(STD)/(G_(STD) + K₁ + K₂ * W_(SD) * (H_(SD)/H_(SO))), where:$\begin{matrix}{G_{STD} = {{the}{\mspace{11mu}\;}{generalized}{\;\mspace{11mu}}{term}{\mspace{11mu}\;}{count}{\mspace{11mu}\;}{for}{\mspace{11mu}\;}{Term}\mspace{14mu} T\mspace{14mu}{in}\mspace{14mu}{Segment}\mspace{14mu} S_{1}}} \\{{{of}{\;\mspace{11mu}}{Document}\mspace{14mu} D},} \\{{= {W_{SD}*W_{STD}*N_{STD}}},}\end{matrix}$where:

W_(SD) is the weight assigned to segment S_(i) of document D,

W_(STD) is the weight assigned to term T in segment S_(i) of document D,and

N_(STD) is the number of times the term T occurs in segment S_(i) ofdocument D,

$\begin{matrix}{{H_{SD} = {{the}{\mspace{11mu}\;}{generalized}{\mspace{11mu}\;}{length}{\mspace{11mu}\;}{of}\mspace{14mu}{segment}\mspace{14mu} S_{i}\mspace{14mu}{of}{\mspace{11mu}\;}{document}\mspace{14mu} D}},} \\{H_{SD} = {\sum\limits_{T = 1}^{L_{SD}}{W_{STD}*N_{STD}}}}\end{matrix}$where:L_(SD)  is   the   number   of   different   terms  in $\mspace{79mu}{{{segment}\mspace{14mu} S_{i}\mspace{14mu}{of}{\mspace{11mu}\;}{document}\mspace{14mu} D},\begin{matrix}{H_{SO} = {{the}{\;\mspace{11mu}}{generalized}{\mspace{11mu}\;}{average}{\mspace{11mu}\;}{length}{\mspace{11mu}\;}{of}{\;\mspace{11mu}}{segment}\mspace{14mu} S_{i}}} \\{{{of}\mspace{14mu}{documents}\mspace{14mu}{in}\mspace{14mu}{the}{\mspace{11mu}\;}{collection}\mspace{14mu} C_{0}\mspace{14mu}{being}{\mspace{11mu}\;}{searched}},} \\{{H_{SO} = {\sum\limits_{N = 1}^{N_{0}}{\left( {W_{SD}*H_{SD}} \right)/{\sum\limits_{N = 1}^{N_{0}}W_{SD}}}}},}\end{matrix}}$where: N₀ is the number of documents in the collection C₀,and

K₁ and K₂ are constants (In one embodiment, K₁ may be assigned a valueof 0.5, and K₂ 1.5, but these values may be varied without departingfrom the spirit and scope of the invention.)

In this system, IDF_(ST)=the generalized inverted document frequency forterm T,IDF _(ST)=log((N ₀ +K ₂)/N _(ST))log(N ₀ +K ₄)where:

-   -   N₀ is the number of documents in the collection C₀    -   N_(ST) is the number of documents in the collection C₀        containing the term T in the segment S_(i),

K₃ and K₄ are constants. (In one embodiment, K₃ may be assigned a valueof 0.5, and K_(4 1.0), but these values may be varied without departingfrom the spirit and scope of the invention.)

In one embodiment of the system/ each segment S_(i) of a document Dconsists of a portion of the text of the document D, and there are nosegments containing index terms. In this embodiment, the weights W_(STD)assigned to terms T in the segments S_(i) of the document D are equal.In this embodiment, the factors W_(STD), the weights assigned to terms Tin segment S_(i) of document D, may all be considered to be equal to1.0, and the formula simplifies to:

$S_{D} = {\sum\limits_{T = 1}^{T_{0}}{\sum\limits_{S_{i} = 1}^{S_{0}}{{TF}_{STD}*{IDF}_{ST}}}}$where: $\begin{matrix}{{TF}_{STD} = {{{Robertson}'}s{\;\mspace{11mu}}{generalized}{\;\mspace{11mu}}{term}{\;\mspace{11mu}}{frequency}{\;\mspace{11mu}}{score}}} \\{{for}{\;\mspace{11mu}}{Term}\mspace{14mu} T\mspace{14mu}{in}\mspace{14mu}{Segment}\mspace{14mu} S_{i}\mspace{14mu}{of}{\;\mspace{11mu}}{Document}\mspace{14mu} D} \\{{= {G_{STD}/\left( {G_{STD} + K_{1} + {K_{2}*W_{SD}*\left( {H_{SD}/H_{SO}} \right)}} \right)}},}\end{matrix}$ ${where}\text{:}\begin{matrix}{G_{STD} = {{the}{\mspace{11mu}\;}{generalized}{\mspace{11mu}\;}{term}{\;\mspace{11mu}}{count}{\;\mspace{11mu}}{for}{\;\mspace{11mu}}{Term}\mspace{14mu} T\mspace{14mu}{in}\mspace{14mu}{Segment}{\mspace{11mu}\;}S_{1}}} \\{{{of}\mspace{14mu}{Document}\mspace{14mu} D},} \\{= {W_{SD}*N_{STD}}} \\{H_{SD} = {\sum\limits_{T = 1}^{L_{SD}}N_{STD}}} \\{{H_{SO} = {\sum\limits_{N = 1}^{N_{0}}{\left( {W_{SD}*H_{SD}} \right)/{\sum\limits_{N = 1}^{N_{0}}W_{SD}}}}},} \\{{IDF}_{ST} = {{\log\left( {\left( {N_{0} + K_{3}} \right)/N_{ST}} \right)}/{\log\left( {N_{0} + K_{4}} \right)}}}\end{matrix}$

In this embodiment, if the document has only a single segment, thenW_(SD) may be considered to be equal to 1.0 for that segment, and theformula further reduces to:

$S_{D} = {\sum\limits_{T = 1}^{T_{0}}{{TF}_{TD}*{IDF}_{T}}}$ where:$\begin{matrix}{{TF}_{STD} = {{{Robertson}'}s{\;\mspace{11mu}}{generalized}{\;\mspace{11mu}}{term}{\;\mspace{11mu}}{frequency}{\;\mspace{11mu}}{score}}} \\{{for}{\;\mspace{11mu}}{Term}\mspace{14mu} T\mspace{14mu}{in}\mspace{14mu}{Segment}\mspace{14mu} S_{i}\mspace{14mu}{of}{\;\mspace{11mu}}{Document}\mspace{14mu} D} \\{{= {G_{TD}/\left( {G_{TD} + K_{1} + {K_{2}*\left( {H_{D}/H_{O}} \right)}} \right)}},}\end{matrix}$ where: $\begin{matrix}{G_{TD} = {{the}{\mspace{11mu}\;}{generalized}{\mspace{11mu}\;}{term}{\;\mspace{11mu}}{count}{\;\mspace{11mu}}{for}{\;\mspace{11mu}}{Term}\mspace{14mu} T\mspace{14mu}{in}\mspace{14mu}{Segment}{\mspace{11mu}\;}S_{1}}} \\{{{of}\mspace{14mu}{Document}\mspace{14mu} D},} \\{= N_{TD}} \\{H_{D} = {\sum\limits_{T = 1}^{L_{D}}N_{TD}}} \\{{H_{O} = {\sum\limits_{N = 1}^{N_{0}}{\left( H_{D} \right)/N_{0}}}},} \\{{IDF}_{ST} = {{\log\left( {\left( {N_{0} + K_{3}} \right)/N_{T}} \right)}/{\log\left( {N_{0} + K_{4}} \right)}}}\end{matrix}$

This is the conventional Robertson's term frequency score for anunsegmented text document.

In another embodiment of the system, in which a segment S_(I) of adocument D contains index terms automatically associated with thedocument D according to the system, the weight W_(STD) assigned to anindex term T_(n) in segment S_(I) of a document D is

${W_{STD} = {{f_{D}\left( T_{n} \right)}/{\sum\limits_{T = 1}^{L_{SD}}{f_{D}\left( T_{t} \right)}}}},$where f_(D) (T_(n)) has the value set forth above, and L_(SD) is thenumber of index terms in segment S_(I) of document D.

In this embodiment of the system, other segments of a document D maycontain the text of the document D itself, or portions of the text, orother index terms associated with the document by other methods.

In the embodiment of the system in which only the index termsautomatically associated with the document by the system are utilized tocarry out a search query, the formula for the score assigned to adocument according to the system reduces to the following:

$S_{D} = {\sum\limits_{T = 1}^{T_{0}}{{TF}_{TD}*{IDF}_{T}}}$ where:S_(D)  is   the   total   score   for   the   document  D, T₀  is   the  number  of   terms   which   occur  in   the   query  Q, TF_(TD) = Robertson′s   generalized   term   frequency   score   for   Term  Tof  Document  D = G_(TD)/(G_(TD) = K₁ + K₂), where: $\begin{matrix}{{G_{TD} = {{the}{\mspace{11mu}\;}{generalized}{\;\mspace{11mu}}{term}{\;\mspace{11mu}}{count}{\mspace{11mu}\;}{for}{\;\mspace{11mu}}{Term}\mspace{14mu} T\mspace{14mu}{of}{\mspace{11mu}\;}{Document}\mspace{14mu} D}},} \\{f_{D}\left( T_{n} \right)}\end{matrix}$

In this embodiment, because the weights assigned to the index terms in adocument are normalized, the “length” of every document is 1.0, and thedenominator of Robertson's term frequency score considerably simplifies.

In a further embodiment of the system described herein, it is desired topresent further information to a user who has visited a Web site; whenthe Web site has permitted the user to enter terms describing an item ofinterest to the user. In this embodiment, an item of interest may beconsidered to be a product or service, or a number of (related orunrelated) products or services. In response to the user providing termsrelated to the product(s) or service(s) which he is seeking (such as,for example, “automobiles, used”), the Web site may display for the usera list of categories. Each category (such as, for example, “AutoDealers, Used Cars”) may contain information about merchants, stores orother sources (such as, for example, “Lannan Chevrolet, Oldsmobiles”)for a particular variety of products or services which may relate to theproduct(s) or service(s) which the user is seeking. In this embodiment,merchants or stores who carry products or services may be assigned tomore than one category (variety of product or service). The user thenmay select a particular category from the list of categories displayedto him, and the items of interest (merchants or stores) in that categorywill be displayed for him.

In this embodiment of the system described herein, it is desired topresent additional material to a user who is searching for particularproducts or services, in addition to the list of categories whichcontain merchants or stores who may carry the desired product orservice. For example, it may be desired to present the user with banneradvertisements, such as for automobile financing, which relate to theproduct or service, such as automobiles, for which he is searching.

In one embodiment of the system described herein, there may be a verylarge number of individual merchants or stores to be organized intocategories of products or services for presentation.

In this embodiment of the system, there are fewer categories of productsor services than individual merchants or stores. While the number mayvary without departing from the spirit and scope of the invention, inone embodiment of the system there may be about 20,000 categories. Eachcategory has associated with it a set of terms (such as, for example,“Auto Dealers, Used Cars”) which describe the product(s) or service(s)which the merchants, stores or other sources associated with thecategory may provide. Each category further has associated with it acategory identifier term which is unique to it, and serves to identifythe category.

In this embodiment of the system, it is desired to choose a banneradvertisement to present to a user The banner advertisements in turn maybe divided into categories. While the number may vary without departingfrom the spirit and scope of the invention, there may be about 50categories into which the banner advertisements may be divided. (Toavoid confusion with the categories into which the items of interest aredivided, these banner advertisement categories will be referred tohereafter as “supercategories.”)

As illustrated by FIG. 10, it is desirable in this embodiment of thesystem to assign each category 2210 of merchants or stores to one andonly one supercategory 2220 of banner advertisements. In this embodimentof the system, each supercategory has associated with it the sets ofterms (such as, for example, “Auto Dealers, Used Cars”) which describethe product(s) or service(s) which the merchants, stores or othersources associated with the categories assigned to it may provide. Eachsupercategory further has associated with it the category identifierterms which are unique to the categories assigned to it.

According to FIG. 11, this method 2230 proceeds first at a step 2240 toselect every category C_(i) of merchants or stores 2210 which hasassociated with it a term or terms (such as, for example, “Auto Dealers,Used Cars”) describing the product(s) or service(s) which the merchants,stores or other sources associated with the category may provide, thatmatches any term or terms in the user query Q_(i) (such as “automobiles,used”).

After every such category C_(i) of merchants or stores 2210 is selectedat the step 2240, control passes to a step 2340. At the step 2340, a newQuery Q′_(i) is prepared, consisting of the original user Query Q_(i)with the addition of all terms which describe the product(s) orservice(s) which the merchants, stores or other sources associated withthe said categories C_(i) may provide, and with the further addition ofthe unique category identifier terms T_(i) which identify the categoriesC_(i).

After the new Query Q′_(i) is prepared at the step 2340, control passesto a step 2350, at which the new Query Q′_(i) is run, on the collectionC′_(o) of supercategories 2220. There are a number of methods of runningthe query Q′_(i) on the collection C′_(o) of supercategories 2220, whichwill be known to one of ordinary skill in the art.

In one embodiment the query is run by utilizing Robertson's termfrequency score, where the score for a supercategory S_(c) is determinedby:

$S_{D} = {\sum\limits_{T = 1}^{T_{0}}{{TF}_{TD}*{IDF}_{T}}}$$\begin{matrix}{{{where}\text{:}T_{0}\mspace{20mu}{is}{\;\mspace{11mu}}{the}\mspace{14mu}{number}\mspace{14mu}{of}{\;\mspace{11mu}}{terms}{\mspace{11mu}\;}{which}{\;\mspace{11mu}}{occur}\mspace{14mu}{in}{\mspace{11mu}\;}{the}{\;\mspace{11mu}}{query}\mspace{14mu} Q_{i}^{\prime}},} \\{{{TF}_{TD}\mspace{14mu}{is}{\;\mspace{11mu}}{{Robertson}'}s{\;\mspace{11mu}}{term}\mspace{14mu}{frequency}{\;\mspace{11mu}}{for}{\;\mspace{11mu}}{term}\mspace{14mu} T}\mspace{14mu}} \\{{{in}\mspace{14mu}{supercategory}\mspace{14mu} S_{c}},} \\{{= {N_{TC}/\left( {N_{TC} + K_{1} + {K_{2}*\left( {L_{C}/L_{0}} \right)}} \right)}},}\end{matrix}$ $\begin{matrix}{{where}\text{:}N_{TC}\mspace{14mu}{is}{\mspace{11mu}\;}{the}{\mspace{11mu}\;}{number}{\mspace{11mu}\;}{of}{\mspace{11mu}\;}{times}{\mspace{11mu}\;}{the}\mspace{14mu}{term}\mspace{14mu} T\mspace{14mu}{occurs}\mspace{14mu}{in}\mspace{14mu}{supercategory}} \\{S_{C},} \\{{L_{C}{\mspace{11mu}\;}{is}{\;\mspace{11mu}}{the}{\mspace{11mu}\;}{length}{\mspace{11mu}\;}{of}{\;\mspace{11mu}}{supercategory}\mspace{14mu} S_{c}},} \\{{L_{0}\mspace{14mu}{is}{\mspace{11mu}\;}{the}{\mspace{11mu}\;}{average}{\mspace{11mu}\;}{length}{\mspace{11mu}\;}{of}{\mspace{11mu}\;}a{\mspace{11mu}\;}{supercategory}},{and}} \\{K_{1}\mspace{14mu}{and}\mspace{14mu} K_{2}\mspace{14mu}{are}\mspace{14mu}{constants}} \\{{{and}\mspace{14mu}{IDF}_{T}} = {{\log\left( {\left( {N + K_{3}} \right)/N_{T}} \right)}/{\log\left( {N + K_{4}} \right)}}}\end{matrix}$where:

-   -   N is the number of supercategories in the collection    -   N_(T) is the number of supercategories containing the term T,        and K₃ and K₄ are constants.

In another embodiment of the system, the categories have been assignedto supercategories by a combination of methods. In this embodiment, acertain number of the categories may have been assigned tosupercategories manually, while the remainder may have been assigned tosupercategories utilizing a variety of automatic or semi-automatic indexterm augmentation techniques. While the number of categories assignedmanually may vary without departing from the spirit and scope of theinvention, and the number and type of automatic and semi-automatic indexterm augmentation techniques utilized may vary without departing fromthe spirit and scope of the invention, in one embodiment about 2,000 outof about 20,000 categories are assigned manually and the remainder bythe semi-automatic technique of this system, which utilizes theco-occurrence of terms between the categories assigned manually and anunassigned category to help assign the unassigned categories.

In one embodiment of the system, it is further desired in evaluatingqueries Q′_(i) and selecting a supercategory to assign differing weightsto the terms and term identifiers associated with categories, dependingon whether the category has been manually assigned to a supercategory,or assigned automatically or semi-automatically. While the weights thusassigned may vary without departing from the spirit and scope of theinvention, in one embodiment the terms and term identifiers associatedwith categories manually assigned to supercategories are assigned aweight of 1.0, while the terms and term identifiers associated withcategories assigned to supercategories by the semi-automatic method ofthe system described herein which utilizes the co-occurrence of termsbetween the manually-assigned categories and an unassigned category tohelp assign the unassigned categories are assigned a weight of 0.4.

In this embodiment, in order to evaluate the query Q′_(i) thesupercategories are considered to comprise multiple segments. In onesegment are the terms and term identifiers associated with thecategories assigned to the supercategory manually, while each of theother segments comprises the terms and term identifiers associated withthe categories assigned to the supercategory by a particular automaticor semi-automatic method. In this embodiment the generalized termfrequency score for a supercategory SC with respect to the query Q′_(i)may be calculated as follows:

$S_{C} = {\sum\limits_{T = 1}^{T_{0}}{\sum\limits_{S_{i} = 1}^{S_{0}}{{TF}_{STC}*{IDF}_{ST}}}}$where:S_(c)  is   the   total   score   for   the   supercategory  S_(c), T₀  is  the  number  of  terms  which   occur  in  the   query  Q_(i)^(′), S₀  is   the  number  of   segments  in  the  supercategory  S_(c), TF_(STC) = Robertson′s  generalized   term  frequency  score   for   Term  T  in  Segment  S_(i)  of   supercategory  S_(c) = G_(STC)/(G_(STC) + K₁ + K₂ * W_(SC) * (H_(SC)/H_(SO))),where:

$\begin{matrix}{{G_{STC} = {{the}{\mspace{11mu}\;}{generalized}{\mspace{11mu}\;}{term}{\mspace{11mu}\;}{count}\mspace{14mu}{for}\mspace{14mu}{Term}\mspace{14mu} T\mspace{14mu}{in}}}\mspace{11mu}} \\{{{Segment}\mspace{14mu} S_{i}{\mspace{11mu}\;}{of}{\mspace{11mu}\;}{supercategory}\mspace{14mu} S_{c}},} \\{{= {W_{SC}*W_{STC}*N_{STC}}},}\end{matrix}$ where:W_(SC)  is   the   weight   assigned   to   segment  S_(i)   of   the   supercategories, W_(STC)  is   the  weight  assigned   to  term  T  in  segment  S_(i)   of   supercategory  S_(C), and${N_{STC}\mspace{14mu}{is}{\mspace{11mu}\;}{the}{\mspace{11mu}\;}{number}\mspace{14mu}{of}{\mspace{11mu}\;}{times}{\mspace{11mu}\;}{the}{\mspace{11mu}\;}{term}{\mspace{11mu}\;}T{\mspace{11mu}\;}{occurs}\mspace{14mu}{in}\mspace{14mu}{segment}\mspace{14mu} S_{i}{\mspace{11mu}\;}{of}{\;\mspace{11mu}}{supercategory}\mspace{14mu} S_{C}},{H_{SC} = {{the}{\mspace{11mu}\;}{generalized}{\mspace{11mu}\;}{length}\mspace{14mu}{of}\mspace{14mu}{segment}\mspace{14mu} S_{i}\mspace{14mu}{of}{\mspace{11mu}\;}{supercategory}{\mspace{11mu}\;}S_{C}}},{H_{SC} = {\sum\limits_{T = 1}^{L_{SC}}{W_{STC}*N_{STC}}}}$where:

L_(SC) is the number of different terms in segment S_(i) ofsupercategory S_(C),

H_(SO)=the generalized average length of segment S_(i) of thesupercategories,

${H_{SO} = {\sum\limits_{C = 1}^{C_{0}}{\left( {W_{SC}*H_{SC}} \right)/{\sum\limits_{C = 1}^{C_{0}}W_{SC}}}}},$where: C₀ is the number of supercategories and

K₁ and K₂ are constants (In one embodiment, K₁ nay be assigned a valueof 0.5, and K₂ 1.5, but these values may be varied without departingfrom the spirit and scope of the invention.)

In this system, IDF_(ST)=the generalized inverted document frequency forterm T,IDF _(ST)=log((C ₀ +K ₃)/C _(ST))/log(C₀+K₄)where:

-   -   C₀ is the number of supercategories    -   C_(ST) is the number of supercategories containing the term T in        the segment S_(i),

K₃ and K₄ are constants. (In one embodiment, K₃ may be assigned a valueof 0.5, and K₄ 1.0, but these values may be varied without departingfrom the spirit and scope of the invention.)

In the embodiment of the system in which the terms and term identifiersassociated with categories manually assigned to a supercategory areassigned a weight of 1.0, and are assigned to one segment of thesupercategory, while the terms and term identifiers associated withcategories assigned to the supercategory by the semi-automatic method ofthe system described herein, which utilizes the co-occurrence of termsbetween the manually-assigned categories and an unassigned category tohelp assign the unassigned categories, are assigned to the other segmentof the supercategory, and are assigned a weight of 0.4, the generalizedterm frequency score for a supercategory S_(C) with respect to the queryQ′_(i) may be calculated as follows, where all terms in a segment areassigned equal weight W_(STC):

$S_{C} = {\sum\limits_{T = 1}^{T_{0}}{\sum\limits_{S_{i} = 1}^{2}{{TF}_{STC}*{IDF}_{ST}}}}$where:S_(C)  is  the   total   score   for  the  superategory  S_(C), T₀  is   the   number   of  terms   which   occur  in  the  query  Q_(i)^(′), TF_(STC) = Robertson′s   generalized   term   frequency  score   for   Term  T  in  Segment  S_(i)  of   supercategory  S_(C) = G_(STC)/(G_(STC) + K₁ + K₂ * W_(SC) * (H_(SC)/H_(SO))), where:G_(STC) = the   generalized  term   count  for   Term  T  in  Segment  S_(i)  of   supercategory  S_(C),  = W_(SC) * N_(STC),where:

W_(SC), the weight assigned to segment S_(i) of the supercategories,

W_(SC)=1.0 for the segment which comprises the terms and termidentifiers associated with the categories manually assigned to thesupercategory S_(i),

W_(SC)=0.4 for the segment which comprises the terms and termidentifiers associated with the categories assigned to the supercategoryS_(i) by the semi-automatic method of the system described herein, whichutilizes the co-occurrence of terms between the manually-assignedcategories and an unassigned category to help assign the unassignedcategories, and

N_(STC) is the number of times the term T occurs in segment S_(i) ofsupercategory S_(c),

H_(SC)=the generalized length of segment S_(i) of supercategory S_(c),

$H_{SC} = {\sum\limits_{T = 1}^{L_{SC}}N_{STC}}$where:

L_(SC) is the number of different terms in segment S_(i) ofsupercategory S_(c),

H_(SO)=the generalized average length of segment S_(i) of thesupercategories,

${H_{SO} = {\sum\limits_{C = 1}^{C_{0}}{\left( {W_{SC}*H_{SC}} \right)/{\sum\limits_{C = 1}^{C_{0}}W_{SC}}}}},$where: C₀ is the number of supercategoriesand

K₁ and K₂ are constants (In one embodiment, K₁ may be assigned a valueof 0.5, and K₂ 1.5 but these values may be varied without departing fromthe spirit and scope of the invention.)

In this system, IDF_(ST)=the generalized inverted document frequency forterm T,IDF _(ST)=log((C ₀ +K ₂)/C _(ST))/log(C₀ +K ₄)where:

-   -   C₀ is the number of supercategories    -   C_(ST) is the number of supercategories containing the term T in        the segment S_(i),

K₃ and K₄ are constants. (In one embodiment, K₃ may be assigned a valueof 0.5, and K₄ 1.0, but these values may be varied without departingfrom the spirit and scope of the invention.)

After the new Query Q′_(i) is run on the collection C′_(o) ofsupercategories 2220 at the step 2350, control passes to a step 2360, atwhich the supercategory 2220 which achieves the highest score S_(C) onthe Query Q′_(i) is selected. The process then continues, and a banneradvertisement associated with the supercategory chosen at the step 2360is displayed to the user who has presented the Query Q_(i). In addition,the user is presented with the set of categories C_(i), of merchants orstores 2210 which have associated with them a term or terms describingthe product(s) or service(s) which the merchants, stores or othersources associated with the category may provide, that matches any termor terms in the user query. The user then has the opportunity to selectany of the categories presented, and to have displayed to him the listof merchants, stores or other sources associated with the category.

In this system, when a user, who has been presented with the list ofcategories C_(i), selects a particular category C_(S) for presentationof its list of merchants, stores or other sources, control returns tothe step 2340, with the collection of categories C_(i) replaced by thesingle category C_(S).

At the step 2340, a new Query Q′_(i) is prepared, now consisting of theterms which describe the product(s) or service(s) which the merchants;stores or other sources associated with the single category C_(S) mayprovide, and with the further addition of the unique category identifierterm T_(S) which identifies the category C_(S).

After the new Query Q′_(i) is prepared at the step 2340, control passesto a step 2350, at which the new Query Q′_(i) is run, on the collectionC′_(o) of supercategories 2220.

After the new Query Q′_(i) is run on the collection C′_(o) ofsupercategories 2220 at the step 2350, control passes to a step 2360, atwhich the supercategory 2220 which achieves the highest score on theQuery Q′_(i) is selected. The process then concludes, and a banneradvertisement associated with the supercategory chosen at the step 2360is displayed to the user. In addition, the list of merchants, stores orother sources of the product(s) or service(s) associated with thecategory C_(S) is presented to the user

While the invention has been disclosed in connection with the preferredembodiments shown and described in detail, various modifications andimprovements thereon will become readily apparent to those skilled inthe art. Accordingly, the spirit and scope of the present invention isto be limited only by the following claims.

What is claimed is:
 1. A method implemented by one or more computingdevices, wherein the one or more computing devices are configured toperform the following: selecting a first document; generating a querycontaining at least one term from the selected first document; applyingthe generated query to a plurality of documents to define a subset ofthe plurality of documents, wherein the defined subset of the pluralityof documents constitutes those documents of the plurality of documentsthat contain the at least one term and meet a predetermined threshold ofquery relevance; determining additional terms based on the definedsubset of the plurality of documents, including: determining aco-occurrence metric of the at least one term from the selected firstdocument with each term of the defined subset of the plurality ofdocuments; determining a frequency score using the determinedco-occurrence metric for each term of the defined subset of theplurality of documents; and selecting a subset of terms of the definedsubset of the plurality of documents based on the determined frequencyscore for each term; assigning the selected subset of terms to theselected first document; and storing the selected first document in astorage system that is remotely accessible via a network.
 2. The methodof claim 1, wherein the at least one term includes all terms in theselected first document.
 3. The method of claim 1, wherein queryrelevance is determined using at least one of term frequency scoring andinverted document frequency scoring, and the predetermined threshold ofquery relevance is a maximum number of highest scoring documents.
 4. Themethod of claim 3, wherein the query relevance is determined usingRobertson's term frequency scoring.
 5. The method of claim 1, whereinthe plurality of documents are Web pages.
 6. The method of claim 1,wherein the plurality of documents are Web sites.
 7. The method of claim1, wherein terms do not include stop words.
 8. The method of claim 1,wherein selecting the subset of terms based on the determined frequencyscore for each term includes selecting terms having the determinedfrequency score above a predetermined term assignment threshold.
 9. Themethod of claim 8, wherein the predetermined term assignment thresholdis a single highest scoring term.
 10. The method of claim 1, whereinassigning the selected subset of terms includes inserting the selectedsubset of terms into a portion of the selected first document.
 11. Themethod of claim 10, wherein the portion of the selected first documentis a segment of the selected first document for storing terms to improvedocument retrieval methods.
 12. The method of claim 1, wherein theplurality of documents has previously had index terms assigned to theplurality of documents by another method.
 13. The method of claim 12,wherein weighting is applied to the index terms assigned to theplurality of documents when applying the generated query to theplurality of documents.
 14. The method of claim 1, wherein the networkincludes the Internet.